Nominal Henkin Semantics: simply-typed lambda-calculus models in nominal sets
نویسندگان
چکیده
منابع مشابه
Nominal Henkin Semantics: simply-typed lambda-calculus models in nominal sets
We investigate a class of nominal algebraic Henkin-style models for the simply typed λ calculus in which variables map to names in the denotation and λ -abstraction maps to a (non-functional) name-abstraction operation. The resulting denotations are smaller and better-behaved, in ways we make precise, than functional valuation-based models. Using these new models, we then develop a generalisati...
متن کاملRecognizability in the Simply Typed Lambda-Calculus
We define a notion of recognizable sets of simply typed λterms that extends the notion of recognizable sets of strings or trees. This definition is based on finite models. Using intersection types, we generalize the notions of automata for strings and trees so as to grasp recognizability for λ-terms. We then expose the closure properties of this notion and present some of its applications.
متن کاملAlpha Conversion in Simply Typed Lambda Calculus
In the usual presentations of simply typed-calculus, it is usual to identify terms that are-convertible. However, this is not at all a practise in most (typed) functional languages, for which simply typed-calculus is a theoretical foundation. Here, ve well known variants of the type system for simply-calculus which work with variable names are presented. Essentially, these formulations diier in...
متن کاملSimply Typed Lambda-Calculus Modulo Type Isomorphisms
We define a simply typed, non-deterministic lambda-calculus where isomorphic types are equated. To this end, an equivalence relation is settled at the term level. We then provide a proof of strong normalisation modulo equivalence. Such a proof is a non-trivial adaptation of the reducibility method.
متن کاملA Nominal Axiomatization of the Lambda Calculus
The lambda calculus is fundamental in computer science. It resists an algebraic treatment because of capture-avoidance sideconditions. Nominal algebra is a logic of equality designed for specifications involving binding. We axiomatize the lambda calculus using nominal algebra, demonstrate how proofs with these axioms reflect the informal arguments on syntax and we prove the axioms to be sound a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2011
ISSN: 2075-2180
DOI: 10.4204/eptcs.71.5